On Short Expressions for Cosets of Permutation Subgroups
نویسندگان
چکیده
Following Babai’s algorithm (Graph isomorphism in quasipolynomial time, arXiv:1512.03547v2, 2016) for the string problem, we determine that it is possible to write expressions of short length describing certain permutation cosets, including all subgroups. This feasible both original version and its CFSG-free version, by Babai (2016, §13.1) Pyber (A analysis GI algorithm, arXiv:1605.08266, 2016). The existence such descriptions gives a weak form Cameron–Maróti classification, even without assuming CFSG. applicable proofs diameter bounds \(\mathrm {Alt}(n)\) as Helfgott (Growth linear algebraic groups groups: towards unified perspective, arXiv:1804.03049, 2018): our main result used Dona (Towards bound \({\mathrm{Alt}}(n)\), arXiv:1810.02710v3, 2018) free Helfgott’s proof from use We also thoroughly explicate recursion process (as given et al. Graph isomorphisms quasi-polynomial arXiv:1710.04574, 2017) obtain explicit constants runtime with
منابع مشابه
Automatic groups, subgroups and cosets
The history, definition and principal properties of automatic groups and their generalisations to subgroups and cosets are reviewed briefly, mainly from a computational perspective. A result about the asynchronous automaticity of an HNN extension is then proved and applied to an example that was proposed by Mark Sapir. AMS Classification 20F32; 20F05
متن کاملA Note on Short Cosets
We describe some improved techniques for the computation of short cosets. This speeds up the computation of Galois groups in magma.
متن کاملCosets, Lagrange’s theorem and normal subgroups
Our goal will be to generalize the construction of the group Z/nZ. The idea there was to start with the group Z and the subgroup nZ = 〈n〉, where n ∈ N, and to construct a set Z/nZ which then turned out to be a group (under addition) as well. (There are two binary operations + and · on Z, but Z is just a group under addition. Thus, the fact that we can also define multiplication on Z/nZ will not...
متن کاملA Model for the Double Cosets of Young Subgroups
There are several results concerning double cosets of Young subgroups of symmetric groups which are often proved as corollaries of more general results about Coxeter groups. In this note we give a selection of these results and give them the short combinatorial proofs they deserve. Our replacement for the machinery of Coxeter groups consists of some simple combinatorial arguments involving tabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2021
ISSN: ['0219-3094', '0218-0006']
DOI: https://doi.org/10.1007/s00026-021-00535-6